Efficient joint detection

ABSTRACT

Data signals are received over a shared spectrum in a code division multiple access communication format as a combined signal. The combined signal is sampled as a plurality of received vector versions. A plurality of system matrices and an associated covariance matrix using codes and estimated impulse responses of the data signals is produced. Each system matrix corresponds to a received vector version. The system and covariance matrices are extended and approximated as block circulant matrices. A diagonal matrix of each of the extended and approximated system and covariance matrices are determined by prime factor algorithm-fast Fourier transform (PFA-FFT)without division of the matrix. The received vector versions are extended. A product of the diagonal matrices and the extended received vector versions is taken. An inverse block discrete Fourier transform is performed by a PFA-FFT a on a result of the product to produce the estimated data.

CROSS REFERENCE TO THE RELATED APPLICATION(S)

This application is a continuation of U.S. patent application Ser. No. 11/926,534 filed Oct. 29, 2007 which is a continuation of U.S. patent application Ser. No. 10/644,361 filed Aug. 20, 2003 which claims the benefit of U.S. Provisional Application No. 60/404,561, filed Aug. 20, 2002, which are incorporated by reference as if fully set forth.

BACKGROUND

FIG. 1 is an illustration of a wireless communication system 10. The communication system 10 has base stations 12 ₁ to 12 ₅ (12) which communicate with user equipments (UEs) 14 ₁ to 14 ₃ (14). Each base station 12 has an associated operational area, where it communicates with UEs 14 in its operational area.

In some communication systems, such as frequency division duplex using code division multiple access (FDD/CDMA) and time division duplex using code division multiple access (TDD/CDMA), multiple communications are sent over the same frequency spectrum. These communications are differentiated by their channelization codes. To more efficiently use the frequency spectrum, TDD/CDMA communication systems use repeating frames divided into timeslots for communication. A communication sent in such a system will have one or multiple associated codes and timeslots assigned to it.

Since multiple communications may be sent in the same frequency spectrum and at the same time, a receiver in such a system must distinguish between the multiple communications. One approach to detecting such signals is multiuser detection (MUD). In MUD, signals associated with all the UEs 14, are detected simultaneously. For TDD/CDMA systems, one of the popular MUD techniques is a joint detection technique using block linear equalizer (BLE-JD). Techniques for implementing BLE-JD include using a Cholesky or an approximate Cholesky decomposition. These approaches have high complexity. The high complexity leads to increased power consumption, which at the UE 14 results in reduced battery life.

Accordingly, it is desirable to have computationally efficient approaches to detecting received data.

SUMMARY

K data signals, or bursts, are transmitted over a shared spectrum in a code division multiple access communication format. A combined signal is received and sampled over the shared spectrum, as a plurality of received vector versions. The combined signal includes the K transmitted data signals. A plurality of system matrices and an associated covariance matrix using codes and estimated impulse responses of the K data signals is produced. Each system matrix corresponds to a received vector version. The system and covariance matrices are extended and approximated as block circulant matrices. A diagonal matrix of each of the extended and approximated system and covariance matrices are determined by prime factor algorithm-fast Fourier transform (PFA-FFT) without division of the matrices. The received vector versions are extended. A product of the diagonal matrices and the extended received vector versions is taken. An inverse block discrete Fourier transform is performed by a PFA-FFT on a result of the product to produce the estimated data of the K data signals.

BRIEF DESCRIPTION OF THE DRAWING(S)

FIG. 1 is a wireless communication system.

FIG. 2 is a simplified transmitter and an efficient joint detection receiver.

FIG. 3 is an illustration of a communication burst.

FIGS. 4 a and 4 b are a flow chart of a preferred embodiment for efficient joint detection.

FIG. 5 is an illustration of a data burst indicating extended processing areas.

FIG. 6 is a block diagram of a preferred implementation of efficient joint detection.

FIG. 7 is a simplified receiver having multiple antennas.

FIG. 8 is a simplified receiver sampling the received signal using fractional sampling.

FIG. 9 is a simplified receiver having multiple antennas and using fractional sampling.

FIG. 10 is a block diagram of a preferred implementation of efficient joint detection for fractional sampling or receive diversity.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

FIG. 2 illustrates a simplified transmitter 26 and receiver 28 using efficient joint detection in a TDD/CDMA communication system, although efficient joint detection is applicable to other systems, such as FDD/CDMA. In a typical system, a transmitter 26 is in each UE 14 and multiple transmitting circuits 26 sending multiple communications are in each base station 12. The joint detection receiver 28 may be at a base station 12, UEs 14 or both.

The transmitter 26 sends data over a wireless radio channel 30. A data generator 32 in the transmitter 26 generates data to be communicated to the receiver 28. A modulation/spreading/training sequence insertion device 34 spreads the data with the appropriate code(s) and makes the spread reference data time-multiplexed with a midamble training sequence in the appropriate assigned time slot, producing a communication burst or bursts.

A typical communication burst 16 has a midamble 20, a guard period 18 and two data fields 22, 24, as shown in FIG. 3. The midamble 20 separates the two data fields 22, 24 and the guard period 18 separates the communication bursts to allow for the difference in arrival times of bursts transmitted from different transmitters 26. The two data fields 22, 24 contain the communication burst's data.

The communication burst(s) are modulated by a modulator 36 to radio frequency (RF). An antenna 38 radiates the RF signal through the wireless radio channel 30 to an antenna 40 of the receiver 28. The type of modulation used for the transmitted communication can be any of those known to those skilled in the art, such as quadrature phase shift keying (QPSK) or M-ary quadrature amplitude modulation (QAM).

The antenna 40 of the receiver 28 receives various radio frequency signals. The received signals are demodulated by a demodulator 42 to produce a baseband signal. The baseband signal is sampled by a sampling device 43, such as one or multiple analog to digital converters, at the chip rate of the transmitted bursts. The samples are processed, such as by a channel estimation device 44 and an efficient joint detection device 46, in the time slot and with the appropriate codes assigned to the received bursts. The channel estimation device 44 uses the midamble training sequence component in the baseband samples to provide channel information, such as channel impulse responses. The channel information is used by the efficient joint detection device 46 to estimate the transmitted data of the received communication bursts as soft symbols.

The efficient joint detection device 46 uses the channel information provided by the channel estimation device 44 and the known spreading codes used by the transmitter 26 to estimate the data of the desired received communication burst(s).

Although efficient joint detection is explained using the third generation partnership project (3GPP) universal terrestrial radio access (UTRA) TDD system as the underlying communication system, it is applicable to other systems. That system is a direct sequence wideband CDMA (W-CDMA) system, where the uplink and downlink transmissions are confined to mutually exclusive timeslots.

The receiver 28 receives a total of K bursts that arrive simultaneously, within one observation interval. For the 3GPP UTRA TDD system, each data field of a time slot corresponds to one observation interval. For a frequency division duplex (FDD) CDMA system, the received signals are continuous, i.e., not in bursts. To handle the continuous signals, FDD systems divide the received signals into time segments prior to applying efficient joint detection.

A code used for a k^(th) burst is represented as c^((k)). The K bursts may originate from K different transmitters or for multi-code transmissions, less than K different transmitters.

Each data field of a communication burst has a predetermined number of transmitted symbols, Ns. Each symbol is transmitted using a predetermined number of chips, which is the spreading factor, Q. Accordingly, each data field has N_(S)×Q chips. After passing through the wireless radio channel, which can introduce a delay spread of up to W−1 chips, the observation interval at the receiver is of length Q×N_(S)+W−1 chips.

The symbol response vector b^((k)) as the convolution of the channel response vector h^((k)) with the corresponding spreading code c^((k)) is per Equation 1. b^((k))=h^((k))∘c^((k))  Equation 1 ∘ denotes the convolutional operator. The length of b^((k)) is SF+W−1.

Using the symbol response vectors, the system matrix A is defined as per Equation 2.

$\begin{matrix} {A = \begin{bmatrix} B & \; & \; & \; & \; \\ \; & \overset{\overset{\_}{\updownarrow Q}}{B} & \; & \; & \; \\ \; & \; & B & \; & \; \\ \; & \; & \; & \ddots & \; \\ \; & \; & \; & \; & B \end{bmatrix}} & {{Equation}\mspace{14mu} 2} \end{matrix}$

The size of the matrix is (N_(s)•SF+W−1)×N_(s)•K. A is a block Toeplitz matrix.

Block B is defined as per Equation 3. B=[b⁽¹⁾b⁽²⁾ . . . b^((K))]  Equation 3 The received vector sampled at the chip rate can be represented by Equation 4. r=Ad+n  Equation 4

The size of vector r is (N_(s)•SF+W−1) by 1. This size corresponds to the observation interval.

Data vector d of size N_(s)•K by 1 has the form of Equation 5. d=[d₁ ^(T)d₂ ^(T) . . . d_(N) _(s) ^(T)]^(T)  Equation 5

The sub-vector d_(n) of size K by 1 is composed of the n^(th) symbol of each user and is defined as Equation 6. d_(n)=[d_(n) ⁽¹⁾d_(n) ⁽²⁾ . . . d_(n) ^((K))]^(T), n=1, . . . , N_(s)  Equation 6

The vector n of size (N_(s)•SF+W−1) by 1 is the background noise vector and is assumed to be white.

Determining d using an MMSE solution is per Equation 7. d=R ⁻¹(A ^(H) r)  Equation 7 (•)^(H) represents the Hermetian function (complex conjugate transpose). The covariance matrix of the system matrix R for a preferred MMSE solution is per Equation 8. R=A ^(H) A+σ ² I  Equation 8 σ² is the noise variance, typically obtained from the channel estimation device 44, and I is the identity matrix.

Using block circulant approximation and block DFT using PFA-FFTs, d in Equation 7 can be determined per Equation 9.

$\begin{matrix} \begin{matrix} {\underset{\_}{d} = {{F\left( R^{- 1} \right)}{F\left( {A^{H}\underset{\_}{r}} \right)}}} \\ {F^{- 1}\left( {\Lambda^{- 1}\Lambda_{A}{F\left( {\underset{\_}{r}}_{c} \right)}} \right)} \end{matrix} & {{Equation}\mspace{14mu} 9} \end{matrix}$ F(•) and F⁻¹(•) indicate the block-DFT function and the inverse block-DFT, respectively. The derivation of the block diagonal matrices Λ and Λ_(A) is described subsequently. Instead of directly solving Equation 9, Equation 9 can be solved using the LU decomposition and the forward and backward substitution of the main diagonal block of Λ. Alternately, Equation 9 can be solved using Cholesky decomposition.

FIG. 4 is a flowchart for a preferred method of determining the data vector d using fast joint detection. The system matrix A is determined using the estimated channel response vector h^((k)) and the spreading code c^((k)) for each burst, 48. R, the covariance matrix of the system matrix, is formed, 49. The system matrix A and its covariance matrix R are extended block square matrices. The extended A is of size D•Q by D•K and the extended R is of size D•K by D•K, respectively. D is chosen as per Equation 10.

$\begin{matrix} {D \geq \left\lceil {N_{s} + \frac{W - 1}{Q}} \right\rceil} & {{Equation}\mspace{14mu} 10} \end{matrix}$ Both extended matrices are approximated to block circulant matrices, A_(c) and R_(c), 50. Because of the extension of A and R, the received vector, r, is extended to the vector r_(c) of size D•SF×1 by inserting zeros, 51. The block-diagonal matrix, Λ, is determined by taking a block DFT using PFA-FFT of the first block column of R_(c), 52.

The block DFT of matched filtering F(A^(H)r) is approximated by F(A_(c) ^(H)r_(c)). It is calculated by taking a block DFT using PFA-FFT of A_(c) and r_(c), 53. Due to the block-diagonal structure of Λ and Λ_(A), the blocks F(d)^((i)), i=1, . . . , D, are of size K by 1 in F(d). They are determined by performing on the main diagonal blocks, Λ^((i)) of Λ, LU decomposition, Λ^((i))=L^((i))U^((i)), forward substitution, L^((i))y^((i))=Λ_(A) ^((i)) ^(H) F(r_(c))^((i)), 55, and backward substitution, U^((i))[F(d)]^((i))=y^((i)), 56. L^((i)) is a lower triangular matrix. U^((i)) is an upper triangular matrix. Λ_(A) ^((i)) is the i^(th) main diagonal block of size SF by K in Λ_(A) and F(r_(c))^((i)) is the i^(th) block of size Q×1 in F(r_(c)). Λ_(A) is the block DFT using PFA-FFT of the first column of A_(c) and F(r_(c)) is the block DFT using PFA-FFT of the vector, r_(c). The estimated data vector, d, is determined by an inverse block-DFT of F(d), 57.

Although Equation 9 is a MMSE based solution, fast joint detection can be applied to other approaches, such as a zero forcing approach as per Equation 11. Rd=(A ^(H) A)d=A ^(H) r  Equation 11 As shown in Equation 11, in the zero forcing solution, the σ²I term is deleted from Equation 8. The following is a derivation for the MMSE solution, although an analogous derivation can be used for a zero forcing solution.

To reduce the complexity in determining F(A^(H)r), a block DFT using PFA-FFT approach taking advantage of the block-Toeplitz structure of A may be used as shown in Equation 2. First, by repeating B, we extend A to a block-square matrix of size D•Q×D•K, to use all of the chip symbols in the observation interval. The extended A is composed of D² blocks of size Q×K. The extended A is approximated to the block-circulant matrix A_(c).

A_(c) can be decomposed into three matrices per Equation 12. A_(c)=F_((Q)) ^(H)Λ_(A)F_((K))  Equation 12 F_((n))=F

I_(n) is a block DFT using PFA-FFT matrix of size D•n by D•n.

denotes a Kronecker product. I_(n) is an identity matrix of size n×n and F is a DFT matrix of size D×D, whose elements f_(il), i and l=1, 2, . . . , D are per Equation 13.

$\begin{matrix} {f_{il} = {\frac{1}{\sqrt{D}}{\exp\left( {{- j}\frac{2\pi\;{il}}{D}} \right)}}} & {{Equation}\mspace{14mu} 13} \end{matrix}$ D is the length of the DFT and F^(H)F=I. I is an identity matrix of size D×D.

The block diagonal matrix Λ_(A) is of size D•Q×D•K and has the form per Equation 14.

$\begin{matrix} {\Lambda_{A} = \begin{bmatrix} \Lambda_{A}^{(1)} & 0 & \ldots & 0 \\ 0 & \Lambda_{A}^{(2)} & \ldots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \ldots & \Lambda_{A}^{(D)} \end{bmatrix}} & {{Equation}\mspace{14mu} 14} \end{matrix}$

Each of its entries Λ_(A) ^((i)), i=1, 2, . . . , D, is a Q by K block per Equation 15.

$\begin{matrix} {\Lambda_{A}^{(i)} = \begin{bmatrix} \lambda_{1,1}^{({A,i})} & \ldots & \ldots & \lambda_{1,K}^{({A,i})} \\ \vdots & \ddots & \; & \vdots \\ \vdots & \; & \ddots & \vdots \\ \lambda_{Q,1}^{({A,i})} & \ldots & \ldots & \lambda_{Q,K}^{({A,i})} \end{bmatrix}} & {{Equation}\mspace{14mu} 15} \end{matrix}$

Alternatively, the main diagonal blocks, Λ_(A) ^((i)), i=1, 2, . . . , D, can be computed by, per Equation 16. [Λ_(A) ⁽¹⁾ ^(T) Λ_(A) ⁽²⁾ ^(T) . . . Λ_(A) ^((D)) ^(T) ]^(T)=(F _((Q)) A _(c)(:,1:K))  Equation 16 A_(c)(:,1:K) denotes the first block column of A_(c). Namely, the first K columns of A_(c). F_((SF))A_(c)(:,1:K) can be calculated by Q•K parallel non-block DFTs of length D, using PFA-FFTs.

Due to the extension of A, the received vector r is also extended by inserting zeros, becoming vector r_(c) of size D•Q by 1.

Using the above, F(A^(H)r) is approximated to F(A_(c) ^(H)r_(c)). It can be written as Equation 17. F(A _(c) ^(H) r _(c))=F _((K)) ^(H)Λ_(A) ^(H) F _((Q)) r _(c)  Equation 17

The covariance matrix R of size N_(s)•K×N_(s)•K has the block-square matrix form shown in Equation 18.

$\begin{matrix} {R = \begin{bmatrix} R_{0} & R_{1}^{H} & \ldots & R_{L}^{H} & \ldots & \ldots & \ldots & \ldots & 0 & \ldots & 0 & 0 \\ R_{1} & R_{0} & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ \vdots & R_{1} & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ \vdots & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ R_{L} & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ 0 & R_{L} & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ \vdots & 0 & \ddots & R_{L} & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ \vdots & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & 0 & \vdots \\ \vdots & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & R_{L}^{H} & 0 \\ \vdots & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & R_{L}^{H} \\ \vdots & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ 0 & 0 & \ldots & \ldots & \ldots & \ldots & \ldots & \ldots & R_{L} & \ldots & R_{1} & R_{0} \end{bmatrix}} & {{Equation}\mspace{14mu} 18} \end{matrix}$ L is defined per Equation 19.

$\begin{matrix} {L = \left\lceil \frac{Q + W - 1}{Q} \right\rceil} & {{Equation}\mspace{14mu} 19} \end{matrix}$ Each entry, R_(i), in the R matrix is a K by K block and 0 is a K by K zero matrix. Due to the size of the extended A, the matrix R is also extended to size D•K by D•K by inserting zeros.

The extended R is approximated to a block-circulant matrix, R_(c), of size D•K by D•K per Equation 20.

$\begin{matrix} {R_{c} = \begin{bmatrix} R_{0} & R_{1}^{H} & \ldots & R_{L}^{H} & \ldots & \ldots & \ldots & \ldots & 0 & \ldots & R_{2} & R_{1} \\ R_{1} & R_{0} & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ \vdots & R_{1} & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & R_{L} & \vdots \\ \vdots & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & R_{L} \\ R_{L} & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ 0 & R_{L} & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ \vdots & 0 & \ddots & R_{L} & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ \vdots & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & 0 & \vdots \\ R_{L}^{H} & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & R_{L}^{H} & 0 \\ \vdots & R_{L}^{H} & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & R_{L}^{H} \\ \vdots & \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots & \vdots \\ R_{1}^{H} & R_{2}^{H} & \ldots & \ldots & \ldots & \ldots & \ldots & \ldots & R_{L} & \ldots & R_{1} & R_{0} \end{bmatrix}} & {{Equation}\mspace{14mu} 20} \end{matrix}$

The block circulant matrix R_(c), is decomposed into three matrices per Equation 21. R_(c)=F_((K)) ^(H)ΛF_((K))  Equation 21 F_((K))=F

I_(K) is a block DFT using PFA-FFT matrix of size D•K×D•K.

denotes a Kronecker product. I_(K) is an identity matrix of size K×K and F is a DFT matrix of size D×D as described in Equation 13.

The block diagonal matrix Λ of size D•K by D•K has the form per Equation 22.

$\begin{matrix} {\Lambda = \begin{bmatrix} \Lambda^{(1)} & 0 & \ldots & 0 \\ 0 & \Lambda^{(2)} & \ldots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \ldots & \Lambda^{(D)} \end{bmatrix}} & {{Equation}\mspace{14mu} 22} \end{matrix}$ Each of its entries, Λ^((i)), i=1, 2, . . . , D, is a K by K block, per Equation 23A.

$\begin{matrix} {\Lambda^{(i)} = \begin{bmatrix} \lambda_{1,1}^{(i)} & \ldots & \ldots & \lambda_{1,K}^{(i)} \\ \vdots & \ddots & \; & \vdots \\ \vdots & \; & \ddots & \vdots \\ \lambda_{K,1}^{(i)} & \ldots & \ldots & \lambda_{K,K}^{(i)} \end{bmatrix}} & {{Equation}\mspace{14mu} 23A} \end{matrix}$ Alternatively, the main diagonal blocks, Λ^((i)), i=1, 2, . . . , D, can be computed per Equation 23B. [Λ⁽¹⁾ ^(T) Λ⁽²⁾ ^(T) . . . Λ^((D)) ^(T) ]^(T)=(F _((K)) R _(c)(:,1:K)),  Equation 23B R_(c)(:,1:K) denotes the first block column of R_(c). Namely, the first K columns of R_(c). F_((K))R_(c)(:,1:K) can be calculated by K² parallel non-block DFTs of length D, using PFA-FFTs.

The estimated data vector, d, in Equation 7 is preferably approximated per Equation 24A.

$\begin{matrix} \begin{matrix} {\underset{\_}{d} = {R^{- 1}A^{H}\underset{\_}{r}}} \\ {\approx {R_{c}^{- 1}A_{c}^{H}{\underset{\_}{r}}_{c}}} \\ {= {F_{(K)}^{H}\Lambda^{- 1}\Lambda_{A}^{H}F_{(Q)}{\underset{\_}{r}}_{c}}} \end{matrix} & {{Equation}\mspace{14mu} 24A} \end{matrix}$ The block diagonal matrix Λ⁻¹ is per Equation 24B.

$\begin{matrix} {\Lambda^{- 1} = \begin{bmatrix} \Lambda^{{(1)}^{- 1}} & 0 & \ldots & 0 \\ 0 & \Lambda^{{(2)}^{- 1}} & \ldots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \ldots & \Lambda^{{(D)}^{- 1}} \end{bmatrix}} & {{Equation}\mspace{14mu} 24B} \end{matrix}$ The inversion of Λ requires an inversion of K×K matrices, Λ^((i)), i=1, 2, . . . , D.

Equation 24A can be rewritten as Equation 25. F(d)=Λ⁻¹Λ_(A) ^(H) F(r _(c))  Equation 25 F(r_(c)) is per Equations 26A and 26B. F(r _(c))≡F _((Q)) r _(c)  Equation 26A F(d _(c))≡F _((K)) r _(c)  Equation 26B Due to the block-diagonal structure of Λ⁻¹ and Λ_(A) ^(H), Equation 25 can be efficiently calculated as follows. The terms of Equation 25 are partitioned into D blocks, as per Equation 27.

$\begin{matrix} {\begin{bmatrix} {F\left( \underset{\_}{d} \right)}^{(1)} \\ {F\left( \underset{\_}{d} \right)}^{(2)} \\ \vdots \\ {F\left( \underset{\_}{d} \right)}^{(D)} \end{bmatrix} = {{\begin{bmatrix} \Lambda^{{(1)}^{- 1}} & \; & \; & \; \\ \; & \Lambda^{{(2)}^{- 1}} & \; & \; \\ \; & \; & \ddots & \; \\ \; & \; & \; & \Lambda^{{(D)}^{- 1}} \end{bmatrix}\begin{bmatrix} \Lambda_{A}^{(1)} & \; & \; & \; \\ \; & \Lambda_{A}^{(2)} & \; & \; \\ \; & \; & \ddots & \; \\ \; & \; & \; & \Lambda_{A}^{(D)} \end{bmatrix}}^{H}{\quad\begin{bmatrix} {F\left( {\underset{\_}{r}}_{c} \right)}^{(1)} \\ {F\left( {\underset{\_}{r}}_{c} \right)}^{2} \\ \vdots \\ {F\left( {\underset{\_}{r}}_{c} \right)}^{(D)} \end{bmatrix}}}} & {{Equation}\mspace{14mu} 27} \end{matrix}$

Each block in Equation 27 is solved separately, per Equation 28. F(d)^((i))=Λ^((i)) ⁻¹ Λ_(A) ^(H) F(r _(c))^((i))  Equation 28

F(d)^((i)) is a K by 1 vector. Λ^((i)) is a K by K matrix, per Equation 22. Λ_(A) ^((i)) is a Q by K matrix, per Equation 14. F(r_(c))^((i)) is a Q by 1 vector and is composed of elements (1+(i−1)Q) through (i•Q) of F(r_(c)).

To avoid the direct inversion of Λ^((i)), Equation 28 can be solved by using LU decomposition and forward and backward substitution. Equation 28 is rewritten per Equation 29. Λ^((i)) F(d)^((i))=Λ_(A) ^((i)) ^(H) F(r _(c))^((i))  Equation 29 Λ^((i)) is decomposed per Equation 30. Λ^((i))=L^((i))U^((i))  Equation 30 L^((i)) is a lower triangular matrix and U^((i)) is an upper triangular matrix.

Using LU decomposition, Equation 28 is represented as, per Equation 31. L ^((i)) U ^((i)) F(d)^((i))=Λ_(A) ^((i)) ^(H) F(r)^((i))  Equation 31 F(d)^((i)) in Equation 31 is solved by forward substitution, per Equation 32, and backward substitution, per Equation 33. Forward Substitution: L ^((i)) y ^((i))=Λ_(A) ^((i)) ^(H) F(r)^((i))  Equation 32 Backward Substitution: U ^((i)) [F(d)]^((i)) =y ^((i))  Equation 33

Finally, d is determined for all blocks as per Equation 34.

$\begin{matrix} {\underset{\_}{d} = {{F^{- 1}\left( \underset{\_}{d} \right)} = {F^{- 1}\left( \begin{bmatrix} {F\left( \underset{\_}{d} \right)}^{(1)} \\ {F\left( \underset{\_}{d} \right)}^{(2)} \\ \vdots \\ {F\left( \underset{\_}{d} \right)}^{(D)} \end{bmatrix} \right)}}} & {{Equation}\mspace{14mu} 34} \end{matrix}$

FIG. 6 is a block diagram of a preferred implementation of efficient joint detection in a TDD/CDMA system. Using the received vector, r, r_(c) is formed by inserting zeros, then a block DFT 100 of r_(c) is performed per Equation 26, to produce F(r_(c)).

Using the received training sequences, the channel impulse responses for each transmitted burst, h^((k)), is determined by an estimate channel response block 102. Using each channelization code, c^((k)) and the channel impulse response, h^((k)), the system matrix, A, is determined by compute block matrix A block 104 per Equation 2.

To determine Λ_(A), the system matrix A is extended by extend block 132, to use all received chips in the observation interval. The first block column of the block-circulant matrix A_(c) is determined by selecting the first K columns of the extended A matrix by first block column block 114. By taking a block DFT using PFA-FFT 118 using PFA-FFT, Λ_(A) is determined.

To determine Λ, R is first determined by compute R block 140. For an MMSE solution, R=A^(H)A+σ²I is used; for a zero forcing solution, R=A^(H)A is used. Due to the size of the extended A, R is also extended by extend block 134. The first block column of the extended R matrix is determined by selecting the first K columns of the extended R matrix by first block column block 108. The first block column of the extended R matrix is circularized by a circularize block column block 110. It becomes the first block column of a block-circulant R_(c). By taking a block DFT using PFA-FFT by block DFT block 112, Λ is determined.

To efficiently compute the estimated data vector d, Λ_(A), Λ, and F(r_(c)) are divided into blocks Λ_(A) ^((i)), Λ^((i)), and F(r_(c))^((i)), i=1, 2, . . . , D, respectively, exploiting the block-diagonal structures of Λ_(A) and Λ, by partition block 136. The complex conjugate transpose of Λ_(A) ^((i)), Λ_(A) ^((i)) ^(H) , is determined by a transpose block 130. A multiplier 128 multiplies Λ_(A) ^((i)) ^(H) by F(r_(c))^((i)). Λ^((i)) is decomposed using LU decomposition by a LU decomposition block 126, per Equation 30. By performing forward and backward substitution, per Equations 31-33, using forward and backward substitution blocks 124 and 122, respectively, F(d)^((i)) is determined. By repeating the LU decomposition and forward and backward substitution D times, F(d) is found. Taking an inverse block DFT using PFA-FFT of F(d) by block inverse DFT block 120, d is estimated.

FIGS. 7, 8 and 9 are simplified diagrams of receivers applying efficient joint detection to multiple reception antennas and/or fractional (multiple chip rate) sampling. A receiver 28 with multiple reception antennas is shown in FIG. 7. Transmitted bursts are received by each antenna 40 ₁ to 40 _(m) (40). Each antennas' version of the received bursts are reduced to baseband, such as by demodulators 42 ₁ to 42 _(m). The baseband signals for each antenna are sampled by sampling devices 43 ₁ to 43 _(m) to produce a received vector, r₁ to r_(m), for each antenna 40. The samples corresponding to the midamble are processed by a channel estimation device 144 to produce channel response matrices, H₁ to H_(m), for each antenna 40. The received data vector, d, is determined by an efficient joint detection device 142 using the received vectors and the channel response matrices.

A receiver 28 sampling using fraction sampling is shown in FIG. 8. Transmitted bursts are received by the antenna 40. The received bursts are reduced to baseband, such as by a demodulator 42. The baseband signal is sampled by a sampling device 43 to produce factional samples as received vectors, r₁ to r_(m). Each received vector represents chip rate samples sampled at a fraction of a chip offset. To illustrate, for twice the chip rate sampling, two received vectors r₁ and r₂ are produced. Each of those vectors has samples spaced by half a chip in time. Samples corresponding to the midamble are processed by a channel estimation device 144 to produce channel response matrices, H₁ to H_(m), for each set of fractional samples. The received data vector, d, is determined by an efficient joint detection device 142 using the received vectors and the channel response matrices.

A receiver 28 with multiple reception antennas and using fractional sampling is shown in FIG. 9. Transmitted bursts are received by each antenna 40 ₁ to 40 _(i)(40). Each antennas' version of the received bursts are reduced to baseband, such as by demodulators 42 ₁ to 42 _(i). The baseband signals for each antenna are sampled by sampling devices 43 ₁ to 43 _(j) to produce a received vectors, r₁ to r_(m). The received vectors for each antenna correspond to each multiple of the chip rate samples. The samples corresponding to the midamble are processed by a channel estimation device 144 to produce channel response matrices, H₁ to H_(m), for each antenna's fractional samples. The received data vector, d, is determined by an efficient joint detection device 142 using the received vectors and the channel response matrices.

In applying efficient joint detection to either receive diversity, fractional sampling or both, the received communication bursts are viewed as M virtual chip rate received bursts. To illustrate, for twice the chip rate sampling and two antenna receive diversity, the received bursts are modeled as four (M=4) virtual chip rate received bursts.

Each received burst is a combination of K transmitted bursts. Each of the K transmitted bursts has its own code. The channel impulse response vector of the k^(th) out of K codes and the m^(th) out of the M virtual received bursts is h^((k,m)). h^((k,m)) has a length W and is estimated from the midamble samples of the burst of the k^(th) code of the m^(th) virtual received burst.

Each of the N data symbols of the burst of the k^(th) code is per Equation 35. d^((k))=[d₁ ^((k))d₂ ^((k)) . . . d_(N) ^((k))]^(T), 1≦k≦K  Equation 35

The code of the k^(th) burst is per Equation 36. c^((k))=[c₁ ^((k))c₂ ^((k)) . . . c_(Q) ^((k))]^(T), 1≦k≦K  Equation 36

The symbol response of the k^(th) code's contribution to the m^(th) virtual burst, b^((k,m)) is per Equation 37. b^((k,m))=h^((k,m))

c^((k))  Equation 37

The length of the symbol response is Q+W−1. Q is the spreading factor. The system matrix, A^((m)), for each m^(th) received burst is per Equation 38.

$\begin{matrix} {A^{(m)} = \begin{bmatrix} B^{(m)} & \; & \; & \; & \; \\ \; & \overset{\overset{\_}{\updownarrow Q}}{B^{(m)}} & \; & \; & \; \\ \; & \; & B^{(m)} & \; & \; \\ \; & \; & \; & \ddots & \; \\ \; & \; & \; & \; & B^{(m)} \end{bmatrix}} & {{Equation}\mspace{14mu} 38} \end{matrix}$

Each block B^((m)) is of size (Q+W−1) by K and is per Equation 39. B^((m))=└b^((1,m))b^((2,m)) . . . b^((K,m))┘  Equation 39

The overall system matrix A is per Equation 40.

$\begin{matrix} {A = \begin{bmatrix} A^{(1)} \\ A^{(2)} \\ \vdots \\ A^{(M)} \end{bmatrix}} & {{Equation}\mspace{14mu} 40} \end{matrix}$

As shown in Equation 38, each sub-system matrix A^((m)) is block Toeplitz. The overall received vector of the M virtual bursts is of size M(NQ+W−1) and is per Equation 41. r=[r₁ ^(T)r₂ ^(T) . . . r_(M) ^(T)]^(T)  Equation 41 The m^(th) received vector r_(m) is of size NQ+W−1 by 1.

Equation 42 is a model for the overall received vector. r=Ad+n  Equation 42 n is the noise variance.

Each m^(th) received virtual burst is per Equation 43. r _(m) =A ^((m)) d+n _(m)  Equation 43 n_(m) is the noise variance for the m^(th) received virtual burst.

To solve for the data vector d in Equation 42, a block linear equalizer with either a zero forcing or minimum mean square error (MMSE) approach may be used per Equation 44. {circumflex over (d)}=R⁻¹A^(H)r  Equation 44 R is the covariance matrix.

For a zero forcing solution, R is per Equation 45.

$\begin{matrix} {R = {{\sum\limits_{m = 1}^{M}{A^{{(M)}^{H}}A^{(m)}}} = {A^{H}A}}} & {{Equation}\mspace{14mu} 45} \end{matrix}$

For a MMSE solution, R is per Equation 46.

$\begin{matrix} {R = {{{\sum\limits_{m = 1}^{M}{A^{{(m)}^{H}}A^{(m)}}} + {\sigma^{2}I}} = {{A^{H}A} + {\sigma^{2}I}}}} & {{Equation}\mspace{14mu} 46} \end{matrix}$

The covariance matrix for either the zero forcing or MMSE solution is a block Toeplitz. To apply a discrete Fourier transform to the block-Toeplitz A^((m)) matrix, a block-circulant approximation of A^((m)), A_(c) ^((m)) is used. To make A^((m)) a block-square matrix, A^((m)) is extended. The extended A^((m)) matrix is then approximated to a block circulant matrix A_(c) ^((m)).

The A_(c) ^((m)) matrix is composed of D by D blocks. Each block is of size Q by K. Accordingly, the size of A_(c) ^((m)) becomes DQ by DK. To include all the elements of A^((m)), D is chosen to be an integer larger than D_(min) as determined per Equation 47.

$\begin{matrix} {D_{\min} = \left\lceil {N + \frac{\left( {W - 1} \right)}{Q}} \right\rceil} & {{Equation}\mspace{14mu} 47} \end{matrix}$ ┌•┐ represents a round up to an integer function.

The covariance matrix R is a block-square matrix of size NK by NK with blocks of size K by K. For R to be compatible with the extended A_(c) ^((m)) matrix, R is extended to the size DK by DK by zero-padding and approximating the extended R to a block circulant covariance matrix R_(c). For the received vector, r^((m)), to be compatible with A_(c) ^((m)) and R_(c), r^((m)) is extended to a DQ by 1 vector, r_(c) ^((m)) by zero padding.

After extending the received vectors, r^((m)), the overall received vector is per Equation 48.

$\begin{matrix} {{\underset{\_}{r}}_{c} = \begin{bmatrix} {\underset{\_}{r}}_{c}^{{(1)}^{T}} & {\underset{\_}{r}}_{c}^{{(2)}^{T}} & \ldots & {\underset{\_}{r}}_{c}^{{(M)}^{T}} \end{bmatrix}^{T}} & {{Equation}\mspace{14mu} 48} \end{matrix}$

Each block-circulant matrix A_(c) ^((m)) is diagonalized to a block-diagonal matrix by block discrete Fourier transform matrices per Equation 49. A_(c) ^((m))=F_((Q)) ^(H)Λ_(A) ^((m))F_((K))  Equation 49

F_((Q)) is per Equation 50. F_((Q))=F

I_(Q)  Equation 50

F_((K)) is per Equation 51. F_((K))=F

I_(K)  Equation 51 F is a discrete Fourier transform matrix of size D by D and is an n by n identity matrix. Λ_(A) ^((m)) is a block diagonal matrix of the form of Equation 52.

$\begin{matrix} {\Lambda_{A}^{(m)} = \begin{bmatrix} \Lambda^{({1,m})} & 0 & \ldots & 0 \\ 0 & \Lambda_{A}^{({2,m})} & \ldots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \ldots & \Lambda_{A}^{({D,m})} \end{bmatrix}} & {{Equation}\mspace{14mu} 52} \end{matrix}$

Λ_(A) ^((l,m)) for l=1, . . . , D, and m=1, . . . , M is a non-zero block of size Q by K. 0 is a zero matrix of size Q by K having all zero elements.

Λ_(A) ^((l,m)) is alternately computed per Equation 53. Λ_(A) ^((m))=diag^(B)(F _((Q)) A _(c) ^((m))(:,1:K))  Equation 53

A_(c) ^((m))(:,1:K) is the first block column of A_(c) ^((m)). The first block column having K columns. To determine Λ_(A) ^((m)), preferably F_((Q))A_(c) ^((m))(:,1:K) is determined by QK parallel non-block DFTs of length D, using PFA-FFTs. The block circulant matrix R_(c) is also preferably diagonalized to the block diagonal matrix Λ_(R) by a block DFT matrix F_((K))=F

I_(K) as per Equation 54. R_(c)=F_((K)) ^(H)Λ_(R)F_((K))  Equation 54

The block diagonal matrix Λ_(R) is composed by blocks Λ_(R) ^((l)), l=1, . . . , D of size K by K in its main diagonal block, per Equation 55.

$\begin{matrix} {\Lambda_{R} = \begin{bmatrix} \Lambda_{R}^{(1)} & 0 & \ldots & 0 \\ 0 & \Lambda_{R}^{(2)} & \ldots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \ldots & \Lambda_{R}^{(D)} \end{bmatrix}} & {{Equation}\mspace{14mu} 55} \end{matrix}$

Another approach to determine Λ_(R) is per Equation 56. Λ_(R)=diag^(B)(F _((K)) R _(c)(:,1:K))  Equation 56 R_(c)(:,1:K) is the first block column of R_(c). F_((K))R_(c)(:,1:K) is preferably determined using K² parallel non-block DFTs of length D. In one implementation, the K² parallel non-block DFTs are implemented using K² parallel non-block prime factor algorithm fast Fourier transforms (PFA-FFTs) of length D.

Preferably to perform the block equalization of Equation 44, the matched filtering is approximated per Equation 57.

$\begin{matrix} \begin{matrix} {{A^{H}\underset{\_}{r}} \approx {A_{c}^{H}{\underset{\_}{r}}_{c}}} \\ {= {\sum\limits_{m = 1}^{M}{A^{{(m)}^{H}}{\underset{\_}{r}}_{c}^{(m)}}}} \\ {= {\sum\limits_{m = 1}^{M}{\left( {F_{(Q)}^{H}\;\Lambda_{A}^{(m)}\; F_{(K)}} \right)^{H}{\underset{\_}{r}}_{c}^{(m)}}}} \\ {= {F_{(K)}^{H}{\sum\limits_{m = 1}^{M}{\Lambda_{A}^{{(m)}^{H}}F_{(Q)}{\underset{\_}{r}}_{c}^{(m)}}}}} \end{matrix} & {{Equation}\mspace{14mu} 57} \end{matrix}$

The block-diagonalization of A_(c) ^((m)) is per Equation 58. A_(c)=└A_(c) ⁽¹⁾ ^(T) A_(c) ⁽²⁾ ^(T) . . . A_(c) ^((M)) ^(T) ┘^(T)  Equation 58

The estimation of the data vector {circumflex over (d)}, is per Equation 59.

$\begin{matrix} \begin{matrix} {\underset{\_}{\hat{d}} = {R^{- 1}A^{H}\underset{\_}{r}}} \\ {\approx {R_{c}^{- 1}A_{c}^{H}{\underset{\_}{r}}_{c}}} \\ {= {\left( {F_{(K)}^{H}\Lambda_{R}F_{(K)}} \right)^{- 1}F_{(K)}^{H}{\sum\limits_{m = 1}^{M}\left( {\Lambda_{A}^{{(m)}^{H}}F_{(Q)}{\underset{\_}{r}}_{c}^{(m)}} \right)}}} \\ {= {F_{(K)}^{H}\Lambda_{R}^{- 1}F_{(K)}F_{(K)}^{H}{\sum\limits_{m = 1}^{M}\left( {\Lambda_{A}^{{(m)}^{H}}F_{(Q)}{\underset{\_}{r}}_{c}^{(m)}} \right)}}} \\ {= {F_{(K)}^{H}\Lambda_{R}^{- 1}{\sum\limits_{m = 1}^{M}\left( {\Lambda_{A}^{{(m)}^{H}}F_{(Q)}{\underset{\_}{r}}_{c}^{(m)}} \right)}}} \\ {= {F_{(K)}^{H}\underset{\_}{y}}} \end{matrix} & {{Equation}\mspace{14mu} 59} \end{matrix}$

The vector y is of size DK by 1 and is per Equation 60.

$\begin{matrix} \begin{matrix} {\underset{\_}{y} = {\Lambda_{R}^{- 1}{\sum\limits_{m = 1}^{M}\left( {\Lambda_{A}^{(m)}F_{(Q)}{\underset{\_}{r}}_{c}^{(m)}} \right)}}} \\ {= \left\lbrack {{\underset{\_}{y}}^{{(1)}^{T}}\mspace{14mu}{\underset{\_}{y}}^{{(2)}^{T}}\mspace{14mu}\ldots\mspace{14mu}{\underset{\_}{y}}^{{(D)}^{T}}} \right\rbrack^{T}} \end{matrix} & {{Equation}\mspace{14mu} 60} \end{matrix}$ y^((l)), l=1, . . . D is a vector of size K by 1.

Preferably to determine y, F_((Q))r_(c) ^((m)) is determined using Q parallel non-block DFTs of a length D. In one implementation, the Q parallel non-block DFTs are implemented using Q parallel non-block PFA-FFTs of length D. Λ_(R) ⁻¹ is a block diagonal matrix having blocks of size K by K in the main diagonal and is per Equation 61.

$\begin{matrix} {\Lambda_{R}^{- 1} = \begin{bmatrix} \Lambda_{R}^{{(1)} - 1} & 0 & \ldots & 0 \\ 0 & \Lambda^{{(2)} - 1} & \ldots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \ldots & \Lambda_{R}^{{(D)} - 1} \end{bmatrix}} & {{Equation}\mspace{14mu} 61} \end{matrix}$ Each Λ_(R) ^((l)) ⁻¹ , l=1, . . . , D, is a block of size K by K.

Preferably using the block diagonal structure of Λ_(R) ⁻¹, y^((l)) is determined by the Cholesky decomposition of Λ_(R) ^((l)) and forward and backward substitution in parallel. Alternately, Λ_(R) ^((l)) is directly inverted.

To perform the Cholesky decomposition, a vector

$\sum\limits_{m = 1}^{M}\left( {\Lambda_{A}^{{(m)}^{H}}\mspace{14mu} F_{(Q)}{\underset{\_}{r}}_{c}^{(m)}} \right)$ is divided into D blocks of a size K by 1, per Equation 62.

$\begin{matrix} \begin{matrix} {\underset{\_}{x} = {\sum\limits_{m = 1}^{M}\left( {\Lambda_{A}^{{(m)}^{H}}F_{(Q)}{\underset{\_}{r}}_{c}^{(m)}} \right)}} \\ {= \left\lbrack {{\underset{\_}{x}}^{{(1)}^{T}}\mspace{14mu}{\underset{\_}{x}}^{{(2)}^{T}}\mspace{14mu}\ldots\mspace{14mu}{\underset{\_}{x}}^{{(D)}^{T}}} \right\rbrack^{T}} \end{matrix} & {{Equation}\mspace{14mu} 62} \end{matrix}$ A Cholesky factor G^((l)) of Λ_(R) ^((l)) is determined using a factorization, per Equation 63. Λ_(R) ^((l))=G^((l))G^((l)) ^(H)   Equation 63 Using the Cholesky factor G^((l)), each y^((l)) is determined by forward and backward substitution separately per Equations 64, 65 and 66. Λ_(R) ^((l))y^((l))=G^((l))G^((l)) ^(H) y^((l))=x^((l))  Equation 64 Forward Substitution: Find z^((l)) in G^((l))z^((l))=x^((l)), where z^((l))=G^((l)) ^(H) y^((l))  Equation 65 Backward Substitution: Find y^((l)) in z^((l))=G^((l)) ^(H) y^((l))  Equation 66

By performing a block inverse DFT of y, the data vector d is estimated as {circumflex over (d)}. Preferably, the block inverse DFT is implemented using K parallel non-block inverse PFA-FFTs of a length D.

FIG. 10 is a block diagram of a preferred implementation of efficient joint detection in a TDD/CDMA system. Although FIG. 10 illustrates using two sets of samples, the figure can be extended to other multiple sets. Using the received vector for each set of chip rate samples, r₁ and r₂, r_(c) ⁽¹⁾ and r_(c) ⁽²⁾ is formed by inserting zeros, by Extend blocks 232 ₁ and 232 ₂, respectively. A block DFT 200 ₁ and 200 ₂ using PFA-FFT of r_(c) ⁽¹⁾ and r_(c) ⁽²⁾ is then performed, to produce F_((Q))r_(c) ⁽¹⁾ and F_((Q))r_(c) ⁽²⁾.

Using the received training sequences, the channel impulse responses for each chip rate version of each transmitted burst, h^((k)) ⁽¹⁾ and h^((k)) ⁽²⁾ , is determined by estimate channel response blocks 202 ₁ and 202 ₂. Using each channelization code, c^((k)) and the channel impulse response, h^((k)) ⁽¹⁾ and h^((k)) ⁽²⁾ , each system matrix, A⁽¹⁾ and A⁽²⁾, is determined by compute sub-system matrix blocks 204 ₁ and 204 ₂ per Equations 37 and 38.

To determine Λ_(A) ⁽¹⁾ and Λ_(A) ⁽²⁾, each system matrix, A⁽¹⁾ and A⁽²⁾, is extended by extend blocks 231 ₁ and 231 ₂. The first block column of each block-circulant matrix, A⁽¹⁾ and A⁽²⁾, is determined by selecting the first K columns of the extended A^((m)) matrix by first block column blocks 214 ₁ and 214 ₂. By taking block DFTs 218 ₁ and 218 ₂, Λ_(A) ⁽¹⁾ and Λ_(A) ⁽²⁾ are determined using a PFA-FFT.

To determine Λ_(R), the first block column of R is determined by compute first block column R block 240. The first column of R is extended by extend block 234. The first block column of the extended R is determined by a first block column determining device 208. The first block column of the extended R matrix is circularized, R_(c), by a circularize block column block 210. By taking a block DFT by block DFT block 212, Λ_(R) ⁽ ⁾ is determined using a PFA-FFT.

To efficiently compute the estimated data vector d, each of Λ_(A) ⁽¹⁾, Λ_(A) ⁽²⁾ and F(r_(c) ⁽¹⁾) and F(r_(c) ⁽²⁾) as well as Λ_(R) are used. Each of F(r_(c) ⁽¹⁾), F(r_(c) ⁽²⁾), Λ_(A) ⁽¹⁾, Λ_(A) ⁽²⁾ and Λ_(R) is divided into D blocks, by partition block 236. The complex conjugate transpose of each of Λ_(A) ^((1,i)) and Λ_(A) ^((2,i)), Λ_(A) ^((1,i)) ^(H) and Λ_(A) ^((2,i)) ^(H) , where i is the i^(th) block, is determined by transpose blocks 230, 231. A multiplier 228 multiplies Λ_(A) ^((2,i)) ^(H) by F_((Q))(r_(c) ⁽²⁾)^((i)). A multiplier 229 multiplies Λ_(A) ^((1,i)) ^(H) by F_((Q))(r_(c) ⁽¹⁾)^((i)). A summer 225 sums the multiplied results per Equation 62. Λ_(R) ^((i)) is decomposed using Cholesky decomposition 226, per Equation 63. By performing forward and backward substitution, per Equations 65 and 66, using forward and backward substitution blocks 224 and 222, respectively, F(d) is determined. Taking an inverse block DFT using PFA-FFT of F(d) by block inverse DFT block 220 using a PFA-FFT, {circumflex over (d)} is estimated. 

1. A method of estimating a transmitted data vector d from a received vector r comprising: receiving a wireless communications signal and producing a vector r from the signal, where r has a form r=Ad+n and where A is a block Toeplitz matrix and n is a noise vector; producing a covariance matrix R of the form A^(H)A+σ²I for a minimum mean square error block linear equalizer (MMSE-BLE) based solution, where A^(H) is a Hermetian of A, σ² is a noise variance and I is an identity matrix or A^(H)A for a zero forcing block linear equalizer (ZF-BLE) based solution; extending the A matrix and R matrix; approximating the extended A and R matrices as block circulant matrices; determining a diagonal matrix of each of the extended and approximated A and R matrices, using the block column of the extended and approximated A and R matrices; extending r; taking a Fourier transform of r; taking products of the diagonal matrices and the extended r; summing the products; and estimating d using an inverse Fourier transform and the summed products.
 2. The method of claim 1 wherein the A and R matrices and r are extended to be compatible with a prime factor algorithm fast Fourier transform.
 3. The method of claim 1 further comprising performing LU decomposition on the diagonal of the R matrix and a forward substitution and a backward substitution devices for producing an inverse Fourier transform of d.
 4. The method of claim 1 further comprising performing Cholesky decomposition on the diagonal of the R matrix and a forward substitution and a backward substitution devices for producing an inverse Fourier transform of d. 